#include <bits/stdc++.h>
using namespace std;

int main(int argc, char const *argv[])
{
    // 有序序列
    int a[] = {2, 3, 5, 7, 9, 12, 16, 26, 27, 33, 47, 87, 99, 123, 124, 133, 144, 155, 166, 223, 243, 245, 266, 287, 299, 311, 321, 342, 555, 1234, 6788};

    // 输入你要查找的数据
    int n, k=0;

    bool found = false;
    while(1)
    {
        cin >> n;
        k = 0;

        // 在数组中查找n
        for(int i : a)
        {
            k++;
            if(i == n)
            {
                cout << "找到了[" << k << "]" << endl;
                found = true;
                break;
            }
        }

        if(!found)
            cout << "找不到[" << k << "]" << endl;

        found = false;
    }

    return 0;
}
